全文获取类型
收费全文 | 28672篇 |
免费 | 3340篇 |
国内免费 | 1999篇 |
专业分类
电工技术 | 1245篇 |
综合类 | 2856篇 |
化学工业 | 977篇 |
金属工艺 | 691篇 |
机械仪表 | 2680篇 |
建筑科学 | 1995篇 |
矿业工程 | 878篇 |
能源动力 | 6231篇 |
轻工业 | 217篇 |
水利工程 | 658篇 |
石油天然气 | 1300篇 |
武器工业 | 791篇 |
无线电 | 2068篇 |
一般工业技术 | 1758篇 |
冶金工业 | 736篇 |
原子能技术 | 95篇 |
自动化技术 | 8835篇 |
出版年
2024年 | 74篇 |
2023年 | 392篇 |
2022年 | 758篇 |
2021年 | 827篇 |
2020年 | 906篇 |
2019年 | 795篇 |
2018年 | 740篇 |
2017年 | 989篇 |
2016年 | 1015篇 |
2015年 | 1177篇 |
2014年 | 1759篇 |
2013年 | 1695篇 |
2012年 | 2284篇 |
2011年 | 2505篇 |
2010年 | 1815篇 |
2009年 | 1837篇 |
2008年 | 1687篇 |
2007年 | 2092篇 |
2006年 | 1866篇 |
2005年 | 1489篇 |
2004年 | 1292篇 |
2003年 | 1059篇 |
2002年 | 903篇 |
2001年 | 799篇 |
2000年 | 683篇 |
1999年 | 489篇 |
1998年 | 370篇 |
1997年 | 359篇 |
1996年 | 259篇 |
1995年 | 226篇 |
1994年 | 156篇 |
1993年 | 148篇 |
1992年 | 111篇 |
1991年 | 106篇 |
1990年 | 58篇 |
1989年 | 87篇 |
1988年 | 40篇 |
1987年 | 22篇 |
1986年 | 15篇 |
1985年 | 13篇 |
1984年 | 8篇 |
1983年 | 13篇 |
1982年 | 17篇 |
1981年 | 13篇 |
1980年 | 14篇 |
1979年 | 9篇 |
1978年 | 7篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1975年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 18 毫秒
71.
M. Sanchiz F. Amadieu P.-V. Paubel A. Chevalier 《Behaviour & Information Technology》2020,39(10):1094-1109
ABSTRACT This study investigates how a search interface that displays users’ ultimate query (i.e. users’ current search goal) can cope with the age-related decrease of fluid abilities and support older users’ search behaviours. 30 young and 18 older adults completed 9 search problems with a regular web browser or with the experimental search interface. Results showed that older adults spent longer time on the search engine result pages, they needed more time to reformulate, and they had more difficulties exploring the search paths elaborated. Age-differences also appeared as soon as the beginning of the search. The support tool helped older users reformulate their queries more rapidly and elaborate more flexible search strategies at the beginning of the activity. Indeed, older adults who interacted with the support tool switched to the processing of a new search path more rapidly instead of exploiting their initial query (i.e. they visited fewer websites for the initial query produced and reformulated a query instead of keeping on conducting a deeper investigation of the search results provided in the search engine result page). Implications of these findings for the design of effective support tools for older users are discussed. 相似文献
72.
Wang Yi-Ting Shen Jie Li Zhi-Xu Yang Qiang Liu An Zhao Peng-Peng Xu Jia-Jie Zhao Lei Yang Xun-Jie 《计算机科学技术学报》2020,35(4):724-738
Journal of Computer Science and Technology - Entity linking (EL) is the task of determining the identity of textual entity mentions given a predefined knowledge base (KB). Plenty of existing... 相似文献
73.
User's choices involve habitual behavior and genuine decision. Habitual behavior is often expressed using preferences. In a multiattribute case, the Conditional Preference Network (CP-net) is a graphical model to represent user's conditional ceteris paribus (all else being equal) preference statements. Indeed, the CP-net induces a strict partial order over the outcomes. By contrast, we argue that genuine decisions are environmentally influenced and introduce the notion of “comfort” to represent this type of choices. In this article, we propose an extension of the CP-net model that we call the CP-net with Comfort (CPC-net) to represent a user's comfort with preferences. Given that preference and comfort might be two conflicting objectives, we define the Pareto optimality of outcomes when achieving outcome optimization with respect to a given CPC-net. Then, we propose a backtrack search algorithm to find the Pareto optimal outcomes. On the other hand, two outcomes can stand in one of six possible relations with respect to a CPC-net. The exact relation can be obtained by performing dominance testing in the corresponding CP-net and comparing the numeric comforts. 相似文献
74.
Search results of spatio-temporal data are often displayed on a map, but when the number of matching search results is large, it can be time-consuming to individually examine all results, even when using methods such as filtered search to narrow the content focus. This suggests the need to aggregate results via a clustering method. However, standard unsupervised clustering algorithms like -means (i) ignore relevance scores that can help with the extraction of highly relevant clusters, and (ii) do not necessarily optimize search results for purposes of visual presentation. In this article, we address both deficiencies by framing the clustering problem for search-driven user interfaces in a novel optimization framework that (i) aims to maximize the relevance of aggregated content according to cluster-based extensions of standard information retrieval metrics and (ii) defines clusters via constraints that naturally reflect interface-driven desiderata of spatial, temporal, and keyword coherence that do not require complex ad-hoc distance metric specifications as in -means. After comparatively benchmarking algorithmic variants of our proposed approach – RadiCAL – in offline experiments, we undertake a user study with 24 subjects to evaluate whether RadiCAL improves human performance on visual search tasks in comparison to -means clustering and a filtered search baseline. Our results show that (a) our binary partitioning search (BPS) variant of RadiCAL is fast, near-optimal, and extracts higher-relevance clusters than -means, and (b) clusters optimized via RadiCAL result in faster search task completion with higher accuracy while requiring a minimum workload leading to high effectiveness, efficiency, and user satisfaction among alternatives. 相似文献
75.
《Journal of Great Lakes research》2020,46(4):780-797
Zooplankton distributions are patchy due to multiple physical, chemical, and biological processes, including diel vertical migration (DVM) behavior. Heterogeneity in the offshore environment is difficult to study with net tows, but newer technologies measure finer-scale distributions. Here, we use laser optical plankton counter (LOPC) data, informed by net tows, to study distributions and DVM of zooplankton in offshore Lake Michigan during July and September 2015. Water column (5–60 m) zooplankton biomass varied by an order of magnitude among transects and a factor of two within individual transects (6–19 km distances); transect coefficients of variation (SD/mean) ranged from 7 to 22% (~0.5 km scale). Horizontal patterns in zooplankton biomass varied among size groups but were consistent from day to night, suggesting that processes driving heterogeneity persist for hours to days. Fine-scale LOPC data show that zooplankton often aggregate in thin layers (1–3 m) within the metalimnion, a feature undetectable by coarser net sampling. Although DVM was not consistently observed, some patterns emerged. Small zooplankton including copepodites, diaptomids (Leptodiaptomus ashlandi, L. minutus), and Diacyclops thomasi often migrated to surface waters at night, and large zooplankton (Limnocalanus macrurus) migrated upward at night in most cases. Beam attenuation coefficient (proxy for phytoplankton biomass) was a significant predictor for zooplankton mean depth (p < 0.001) although it explained more of the variation for night data (R2 = 0.72) than day data (R2 = 0.53). The heterogeneity observed in zooplankton distributions has implications for planktivorous fish feeding in the offshore zone, as prey density varies greatly with depth. 相似文献
76.
The economical use of fuel available for the generation of power has become a major concern of electric utilities. This paper presents an approach for economic fuel scheduling problem by using group search optimization. This is a minimization technique that includes the standard load constraints as well as the fuel constraints. The generation schedule is compared to that which would result if fuel constraints were ignored. The comparison shows that fuel consumed can be adequately controlled by adjusting the power output of various generating units so that the power system operates within its fuel limitations and within contractual constraints. It has been found that small additional amount of fuel may be required to serve the same power demand but the additional cost of this fuel may well compensate for the penalty that might otherwise be imposed for not maintaining the fuel contract. Numerical results for two test systems have been presented and the test results obtained from group search optimization are compared with those obtained from particle swarm optimization and evolutionary programming. 相似文献
77.
Semantic search is gradually establishing itself as the next generation search paradigm, which meets better a wider range of information needs, as compared to traditional full-text search. At the same time, however, expanding search towards document structure and external, formal knowledge sources (e.g. LOD resources) remains challenging, especially with respect to efficiency, usability, and scalability.This paper introduces Mímir—an open-source framework for integrated semantic search over text, document structure, linguistic annotations, and formal semantic knowledge. Mímir supports complex structural queries, as well as basic keyword search.Exploratory search and sense-making are supported through information visualisation interfaces, such as co-occurrence matrices and term clouds. There is also an interactive retrieval interface, where users can save, refine, and analyse the results of a semantic search over time. The more well-studied precision-oriented information seeking searches are also well supported.The generic and extensible nature of the Mímir platform is demonstrated through three different, real-world applications, one of which required indexing and search over tens of millions of documents and fifty to hundred times as many semantic annotations. Scaling up to over 150 million documents was also accomplished, via index federation and cloud-based deployment. 相似文献
78.
The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time. 相似文献
79.
Greg A. Breed Paul M. Severns Andrew M. Edwards 《Journal of the Royal Society Interface》2015,12(103)
Lévy flights have gained prominence for analysis of animal movement. In a Lévy flight, step-lengths are drawn from a heavy-tailed distribution such as a power law (PL), and a large number of empirical demonstrations have been published. Others, however, have suggested that animal movement is ill fit by PL distributions or contend a state-switching process better explains apparent Lévy flight movement patterns. We used a mix of direct behavioural observations and GPS tracking to understand step-length patterns in females of two related butterflies. We initially found movement in one species (Euphydryas editha taylori) was best fit by a bounded PL, evidence of a Lévy flight, while the other (Euphydryas phaeton) was best fit by an exponential distribution. Subsequent analyses introduced additional candidate models and used behavioural observations to sort steps based on intraspecific interactions (interactions were rare in E. phaeton but common in E. e. taylori). These analyses showed a mixed-exponential is favoured over the bounded PL for E. e. taylori and that when step-lengths were sorted into states based on the influence of harassing conspecific males, both states were best fit by simple exponential distributions. The direct behavioural observations allowed us to infer the underlying behavioural mechanism is a state-switching process driven by intraspecific interactions rather than a Lévy flight. 相似文献
80.
The scheduling process of cracking furnace feedstock is important in an ethylene plant. In this paper it is described as a constraint optimization problem. The constraints consist of the cycle of operation, maximum tube metal temperature, process time of each feedstock, and flow rate. A modified group search optimizer is pro-posed to deal with the optimization problem. Double fitness values are defined for every group. First, the factor of penalty function should be changed adaptively by the ratio of feasible and general solutions. Second, the“excel-lent”infeasible solution should be retained to guide the search. Some benchmark functions are used to evaluate the new algorithm. Final y, the proposed algorithm is used to optimize the scheduling process of cracking furnace feedstock. And the optimizing result is obtained. 相似文献